Bi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem

Authors

  • Hany Seidgar Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran
  • Rasoul Shafaei Department of Industrial Engineering, K.N. Toosi University of Technology, Tehran, Iran
  • Sahar Tadayoni Rad Department of Industrial Engineering, K.N. Toosi University of Technology, Tehran, Iran
  • Saiedeh Gholami Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran
Abstract:

This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective products.Two-stage assembly flow shop is a combinational production system in which different parts are manufactured on parallel machines independently. This system can be used as a method to produce a variety of products through assembling and combining different set of parts.  We apply e-constraint  method as an exact approach to validate the proposed model and to obtain fronts of the solutions in the solution spaceThe goal of the proposed problem is trade off between two objectives, minimization makespan and total weighted tardiness and earliness. To analyze effects of  n and m factors on the efficiency and performance of the proposed algorithm, we calculate the complexity of sub problems based on factors n and m and the computational results demonstrate that the computational time increases with increasing in n and m, in other words, complexity of the problem increases.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

bi-objective optimization for just in time scheduling: application to the two-stage assembly flow shop problem

this paper considers a two-stage assembly flow shop problem (tafsp) where m machines are in the first stage and an assembly machine is in the second stage. the objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. jit seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...

full text

The Preemptive Just-in-time Scheduling Problem in a Flow Shop Scheduling System

Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs.  In this paper, just-in-time (JIT) flow shop scheduling problem with preemp...

full text

A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation

Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...

full text

A Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

full text

A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times

This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 1  issue 1

pages  21- 32

publication date 2015-02-26

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023